Hybrid Heuristics for The Dial-A-Ride Problem with Transfer and Synchronization in Central Hub

This paper deals with the dial-a-ride problem transfer, where a set of customer demands are divided into two different regions, such as pickup and delivery nodes must not be in same region for given request. Two vehicles needed to meet demand which implies synchronization process between transfer point called central hub. In this paper, we provide solution method based on an adaptive large neighborhood search algorithm (ALNS), stretch solution, gives best space exploration. Effificient constructions methods proposed repair destroyed giving possibility case. An intensifification mechanism is ensured by blending ALNS TS SA algorithms. Implemented algorithms outperform all comparison memetic regardless quality run-time existing benchmarks sets.